TSTP Solution File: SET143^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SET143^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 03:09:14 EDT 2024

% Result   : Theorem 0.20s 0.37s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   14 (   8 unt;   5 typ;   0 def)
%            Number of atoms       :   28 (   9 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :   99 (   8   ~;   0   |;  36   &;  54   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   21 (  21   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    5 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   36 (  18   ^  12   !;   6   ?;  36   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(func_def_0,type,
    a: $tType ).

thf(func_def_7,type,
    sK0: a > $o ).

thf(func_def_8,type,
    sK1: a > $o ).

thf(func_def_9,type,
    sK2: a > $o ).

thf(f10,plain,
    $false,
    inference(trivial_inequality_removal,[],[f9]) ).

thf(f9,plain,
    ( ( ^ [Y0: a] :
          ( ( sK0 @ Y0 )
          & ( sK2 @ Y0 )
          & ( sK1 @ Y0 ) ) )
   != ( ^ [Y0: a] :
          ( ( sK0 @ Y0 )
          & ( sK2 @ Y0 )
          & ( sK1 @ Y0 ) ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f8,plain,
    ( ( ^ [Y0: a] :
          ( ( sK0 @ Y0 )
          & ( sK2 @ Y0 )
          & ( sK1 @ Y0 ) ) )
   != ( ^ [Y0: a] :
          ( ( sK0 @ Y0 )
          & ( sK2 @ Y0 )
          & ( sK1 @ Y0 ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).

thf(f7,plain,
    ( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ^ [Y0: a] :
              ( ( X0 @ Y0 )
              & ( X2 @ Y0 )
              & ( X1 @ Y0 ) ) )
       != ( ^ [Y0: a] :
              ( ( X0 @ Y0 )
              & ( X2 @ Y0 )
              & ( X1 @ Y0 ) ) ) )
   => ( ( ^ [Y0: a] :
            ( ( sK0 @ Y0 )
            & ( sK2 @ Y0 )
            & ( sK1 @ Y0 ) ) )
     != ( ^ [Y0: a] :
            ( ( sK0 @ Y0 )
            & ( sK2 @ Y0 )
            & ( sK1 @ Y0 ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f6,plain,
    ? [X0: a > $o,X1: a > $o,X2: a > $o] :
      ( ( ^ [Y0: a] :
            ( ( X0 @ Y0 )
            & ( X2 @ Y0 )
            & ( X1 @ Y0 ) ) )
     != ( ^ [Y0: a] :
            ( ( X0 @ Y0 )
            & ( X2 @ Y0 )
            & ( X1 @ Y0 ) ) ) ),
    inference(ennf_transformation,[],[f5]) ).

thf(f5,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ^ [Y0: a] :
              ( ( X0 @ Y0 )
              & ( X2 @ Y0 )
              & ( X1 @ Y0 ) ) )
        = ( ^ [Y0: a] :
              ( ( X0 @ Y0 )
              & ( X2 @ Y0 )
              & ( X1 @ Y0 ) ) ) ),
    inference(fool_elimination,[],[f4]) ).

thf(f4,plain,
    ~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
        ( ( ^ [X3: a] :
              ( ( X1 @ X3 )
              & ( X2 @ X3 )
              & ( X0 @ X3 ) ) )
        = ( ^ [X4: a] :
              ( ( X1 @ X4 )
              & ( X2 @ X4 )
              & ( X0 @ X4 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ! [X2: a > $o,X0: a > $o,X1: a > $o] :
        ( ( ^ [X3: a] :
              ( ( X0 @ X3 )
              & ( X1 @ X3 )
              & ( X2 @ X3 ) ) )
        = ( ^ [X3: a] :
              ( ( X0 @ X3 )
              & ( X1 @ X3 )
              & ( X2 @ X3 ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ! [X2: a > $o,X0: a > $o,X1: a > $o] :
      ( ( ^ [X3: a] :
            ( ( X0 @ X3 )
            & ( X1 @ X3 )
            & ( X2 @ X3 ) ) )
      = ( ^ [X3: a] :
            ( ( X0 @ X3 )
            & ( X1 @ X3 )
            & ( X2 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_67_pme) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET143^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon May 20 11:47:23 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a TH0_THM_EQU_NAR problem
% 0.13/0.35  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.36  % (383)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.20/0.36  % (376)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.20/0.36  % (379)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.36  % (378)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.20/0.36  % (381)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.20/0.36  % (376)First to succeed.
% 0.20/0.36  % (380)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.36  % (383)Refutation not found, incomplete strategy
% 0.20/0.36  % (383)------------------------------
% 0.20/0.36  % (383)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.36  % (383)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.36  
% 0.20/0.36  
% 0.20/0.36  % (383)Memory used [KB]: 5500
% 0.20/0.36  % (383)Time elapsed: 0.003 s
% 0.20/0.36  % (383)Instructions burned: 2 (million)
% 0.20/0.36  % (383)------------------------------
% 0.20/0.36  % (383)------------------------------
% 0.20/0.36  % (379)Instruction limit reached!
% 0.20/0.36  % (379)------------------------------
% 0.20/0.36  % (379)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.36  % (379)Termination reason: Unknown
% 0.20/0.36  % (379)Termination phase: Saturation
% 0.20/0.36  
% 0.20/0.36  % (379)Memory used [KB]: 5373
% 0.20/0.36  % (379)Time elapsed: 0.003 s
% 0.20/0.36  % (379)Instructions burned: 2 (million)
% 0.20/0.36  % (379)------------------------------
% 0.20/0.36  % (379)------------------------------
% 0.20/0.37  % (380)Instruction limit reached!
% 0.20/0.37  % (380)------------------------------
% 0.20/0.37  % (380)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37  % (380)Termination reason: Unknown
% 0.20/0.37  % (380)Termination phase: Saturation
% 0.20/0.37  
% 0.20/0.37  % (380)Memory used [KB]: 5500
% 0.20/0.37  % (380)Time elapsed: 0.003 s
% 0.20/0.37  % (380)Instructions burned: 2 (million)
% 0.20/0.37  % (380)------------------------------
% 0.20/0.37  % (380)------------------------------
% 0.20/0.37  % (381)Also succeeded, but the first one will report.
% 0.20/0.37  % (376)Refutation found. Thanks to Tanya!
% 0.20/0.37  % SZS status Theorem for theBenchmark
% 0.20/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.37  % (376)------------------------------
% 0.20/0.37  % (376)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37  % (376)Termination reason: Refutation
% 0.20/0.37  
% 0.20/0.37  % (376)Memory used [KB]: 5373
% 0.20/0.37  % (376)Time elapsed: 0.003 s
% 0.20/0.37  % (376)Instructions burned: 1 (million)
% 0.20/0.37  % (376)------------------------------
% 0.20/0.37  % (376)------------------------------
% 0.20/0.37  % (375)Success in time 0.003 s
% 0.20/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------